Depth-Driven Circuit-Level Stochastic Local Search for SAT
نویسندگان
چکیده
We develop a novel circuit-level stochastic local search (SLS) method D-CRSat for Boolean satisfiability by integrating a structure-based heuristic into the recent CRSat algorithm. D-CRSat significantly improves on CRSat on real-world application benchmarks on which other current CNF and circuit-level SLS methods tend to perform weakly. We also give an intricate proof of probabilistically approximate completeness for D-CRSat, highlighting key features of the method.
منابع مشابه
Depth-based Local Search Heuristics for Boolean Circuit Satisfiability
We propose a structure-exploiting heuristic for the justification-based stochastic local search (SLS) method CRSat for Boolean circuit satisfiability. Experimental evaluation shows that the proposed depth-based heuristic significantly improved the performance of CRSat on structural instances arising from industrial applications. A proof of probabilistically approximate completeness (PAC) of CRS...
متن کاملStructure-Based Local Search Heuristics for Circuit-Level Boolean Satisfiability
This work focuses on improving state-of-the-art in stochastic local search (SLS) for solving Boolean satisfiability (SAT) instances arising from realworld industrial SAT application domains. The recently introduced SLS method CRSAT has been shown to noticeably improve on previously suggested SLS techniques in solving such real-world instances by combining justification-based local search with l...
متن کاملJustification-Based Local Search with Adaptive Noise Strategies
We study a framework called BC SLS for a novel type of stochastic local search (SLS) for propositional satisfiability (SAT). Aimed specifically at solving real-world SAT instances, the approach works directly on a non-clausal structural representation for SAT. This allows for don’t care detection and justification guided search heuristics in SLS by applying the circuit-level SAT technique of ju...
متن کاملStochastic Local Search for SMT: Combining Theory Solvers with WalkSAT
A dominant approach to Satisfiability Modulo Theories (SMT) relies on the integration of a Conflict-Driven-Clause-Learning (CDCL) SAT solver and of a decision procedure able to handle sets of atomic constraints in the underlying theory T (T -solver). In pure SAT, however, Stochastic Local-Search (SLS) procedures sometimes are competitive with CDCL SAT solvers on satisfiable instances. Thus, it ...
متن کاملSAT-Encodings, Search Space Structure, and Local Search Performance
Stochastic local search (SLS) algorithms for prepositional satisfiability testing (SAT) have become popular and powerful tools for solving suitably encoded hard combinatorial from different domains like, e.g., planning. Consequently, there is a considerable interest in finding SAT-encodings which facilitate the efficient application of SLS algorithms. In this work, we study how two encodings sc...
متن کامل